On plane configurations $(12_4,16_3)$
نویسندگان
چکیده
منابع مشابه
On the Combinatorial Classification of Nondegenerate Configurations in the Plane
We classify nondegenerate plane configurations by attaching, to each such configuration of n points, a periodic sequence of permutations of { 1,2,..., n} which satisfies some simple conditions; this classification turns out to be appropriate for questions involving convexity. In 1881 Perrin stated that every sequence satisfying these conditions was the image of some plane configuration. We show...
متن کاملCombinatorics on Plane Trees, Motivated by RNA Secondary Structure Configurations
Motivated by the base pairing of RNA sequences, and as part of our collaboration with A. Condon and H. H. Hoos, we defined the local move operation on two unobstructed edges in a plane tree given here. We now consider the graph Gn induced by this operation on Tn, the set of plane trees with n edges. We provide a series of results showing that Gn is a connected, n-partite graph of diameter n− 1 ...
متن کاملArray Configurations That Tile the Plane
Future radiotelescopes need to have high sensitivity. With the limits of receiver sensitivity being reached this can only be achieved by increasing collecting area. Because of this, next generation telescopes will have hundreds if not thousands of large antennas. The large number of antennas greatly increases the possible array configurations or ways of locating the antennas. In this paper a va...
متن کاملLong non-crossing configurations in the plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computational Geometry, 1993). Given a set of n points in the plane in general position (no three points collinear), compute a longest non-crossing configuration composed of straight line segments that is: (a) a matching (b) a Ha...
متن کاملMaintenance of Configurations in the Plane
For a number of common configurations of points (lines) in the plane, we develop data structures in which insertions and deletions of points (or lines, respectively) can be processed rapidly, without sacrificing much of the efficiency of query answering which known static structures for these configurations attain. As a main result we establish a fully dynamic maintenance algorithm for convex h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1955
ISSN: 0528-2195
DOI: 10.21136/cpm.1955.108170